Separating Underdetermined Convolutive Speech Mixtures
نویسندگان
چکیده
A limitation in many source separation tasks is that the number of source signals has to be known in advance. Further, in order to achieve good performance, the number of sources cannot exceed the number of sensors. In many real-world applications these limitations are too restrictive. We propose a method for underdetermined blind source separation of convolutive mixtures. The proposed framework is applicable for separation of instantaneous as well as convolutive speech mixtures. It is possible to iteratively extract each speech signal from the mixture by combining blind source separation techniques with binary time-frequency masking. In the proposed method, the number of source signals is not assumed to be known in advance and the number of sources is not limited to the number of microphones. Our approach needs only two microphones and the separated sounds are maintained as stereo signals.
منابع مشابه
Underdetermined Convolutive Blind Source Separation via Time-Frequency Masking
In this paper we consider the problem of separation of unknown number of sources from their underdetermined convolutive mixtures via time-frequency (TF) masking. We propose two algorithms, one for the estimation of the masks which are to be applied to the mixture in the TF domain for the separation of signals in the frequency domain, and the other for solving the permutation problem. The algori...
متن کاملA probabilistic approach for blind source separation of underdetermined convolutive mixtures
There are very few techniques that can separate signals from the convolutive mixture in the underdetermined case. We have developed a method that uses overcomplete expansion of the signal created with a time-frequency transform and that also uses the property of sparseness and a Laplacian source density model to obtain the source signals from the instantaneously mixed signals in the underderdet...
متن کاملBlind separation of speech and sub-Gaussian signals in underdetermined case
Conventional blind source separation (BSS) algorithms are applicable when the number of sources equals to that of observations; however, they are inapplicable when the number of sources is larger than that of observations. Most underdetermined BSS algorithms have been developed based on an assumption that all sources have sparse distributions. These algorithms are applicable to separate speech ...
متن کاملUnderdetermined Blind Separation of Convolutive Mixtures of Speech Using Time-Frequency Mask and Mixing Matrix Estimation
This paper focuses on the underdetermined blind source separation (BSS) of three speech signals mixed in a real environment from measurements provided by two sensors. To date, solutions to the underdetermined BSS problem have mainly been based on the assumption that the speech signals are sufficiently sparse. They involve designing binary masks that extract signals at time-frequency points wher...
متن کاملA Natural Gradient Convolutive Blind Source Separation Algorithm for Speech Mixtures
In this paper, a novel algorithm for separating mixtures of multiple speech signals measured by multiple microphones in a room environment is proposed. The algorithm is a modification of an existing approach for density-based multichannel blind deconvolution using natural gradient adaptation. It employs linear predictors within the coefficient updates and produces separated speech signals whose...
متن کامل